Methods and systems for motion vector derivation at a video decoder

ABSTRACT

Method and apparatus for deriving a motion vector at a video decoder. A block-based motion vector may be produced at the video decoder by utilizing motion estimation among available pixels relative to blocks in one or more reference frames. The available pixels could be, for example, spatially neighboring blocks in the sequential scan coding order of a current frame, blocks in a previously decoded frame, or blocks in a downsampled frame in a lower pyramid when layered coding has been used.

CLAIM FOR PRIORITY

This application is a continuation of U.S. patent application Ser. No. 16/552,995, filed on 27 Aug. 2019, now U.S. Pat. No. 10,863,194, entitled “METHODS AND SYSTEMS FOR MOTION VECTOR DERIVATION”, which is a continuation of U.S. patent application Ser. No. 15/960,120, filed on 23 Apr. 2018, now U.S. Pat. No. 10,404,994, entitled “METHODS AND SYSTEMS FOR MOTION VECTOR DERIVATION”, which is a continuation of U.S. patent application Ser. No. 14/737,437, filed on 11 Jun. 2015, now U.S. Pat. No. 9,955,179, entitled “METHODS AND SYSTEMS FOR MOTION VECTOR DERIVATION AT A VIDEO DECODER”, which is a continuation of U.S. patent application Ser. No. 12/567,540, filed on 25 Sep. 2009, now U.S. Pat. No. 9,654,792, entitled “METHODS AND SYSTEMS FOR MOTION VECTOR DERIVATION AT A VIDEO DECODER”, which is a Non-Provisional application of U.S. Provisional Patent Application Ser. No. 61/222,984, filed on 3 Jul. 2009, entitled “METHODS AND SYSTEMS FOR MOTION VECTOR DERIVATION AT A VIDEO DECODER”, all of which are incorporated by reference in their entireties for all purposes.

BACKGROUND

Motion estimation (ME) in video coding may be used to improve video compression performance by removing or reducing temporal redundancy among video frames. For encoding an input block, traditional motion estimation may be performed at an encoder within a specified search window in reference frames. This may allow determination of a motion vector that meets a predefined requirement, such as the minimization of a metric such as the sum of absolute differences (SAD) between the input block and the reference block. The motion vector (MV) information can then be transmitted to a decoder for motion compensation. The video decoder may then utilize the received motion vector information to displace the pixels from the reference frames to form reconstructed output pixels. This displacement may be used to represent the motion compensation.

Note that in the description below, the terms “frame” and “picture” are used interchangeably, as would be understood by persons of ordinary skill in the art.

BRIEF DESCRIPTION OF THE DRAWINGS/FIGURES

FIG. 1 illustrates MV derivation using already decoded blocks from a current frame, according to an embodiment.

FIG. 2 is a flow chart illustrating the process of MV derivation using already decoded blocks from a current frame, according to an embodiment.

FIG. 3 illustrates MV derivation using already decoded blocks from a current frame, where the motion search is based on blocks in two different reference frames, according to an embodiment.

FIG. 4 is a flow chart illustrating MV derivation using already decoded blocks from a current frame, where the motion search is based on blocks in two different reference frames, according to an embodiment.

FIG. 5 illustrates MV derivation using previously decoded blocks from a previously decoded frame, according to an embodiment.

FIG. 6 is a flow chart illustrating MV derivation using previously decoded blocks from a previously decoded frame, according to an embodiment.

FIG. 7 illustrates MV derivation using previously decoded blocks from already decoded previous and succeeding frames, according to an embodiment.

FIG. 8 is a flow chart illustrating MV derivation using previously decoded blocks from already decoded previous and succeeding frames, according to an embodiment.

FIG. 9 illustrates MV derivation using a previously decoded block from a lower level in a layered coding context, according to an embodiment.

FIG. 10 is a flow chart illustrating MV derivation using a previously decoded block from a lower level in a layered coding context, according to an embodiment.

FIG. 11 illustrates a computing context of an exemplary software embodiment.

FIG. 12 is a block diagram showing a self MV derivation module in the context of a H.264 encoder, according to an embodiment.

FIG. 13 is a block diagram showing a self MV derivation module in the context of a H.264 decoder, according to an embodiment.

FIG. 14 is a block diagram illustrating a system, according to an embodiment.

DETAILED DESCRIPTION

The following applies to video compression. The system and method described below may allow derivation of a motion vector (MV) at a video decoder. This can reduce the amount of information that needs to be sent from a video encoder to the video decoder. A block-based motion vector may be produced at the video decoder by performing motion estimation on available previously decoded pixels with respect to blocks in one or more reference frames. The available pixels could be, for example, spatially neighboring blocks in the sequential scan coding order of the current frame, blocks in a previously decoded frame, or blocks in a downsampled frame in a lower pyramid when layered coding has been used. In an alternative embodiment, the available pixels can be a combination of the above-mentioned blocks.

Already Decoded Spatially Neighboring Blocks in the Current Frame

In an embodiment, pixels that can be used to determine an MV may come from spatially neighboring blocks in the current frame, where these blocks have been decoded prior to the decoding of the target block in the current frame. FIG. 1 shows an example 100 utilizing one or more blocks 140 that are above and to the left of the target block 130 in a current frame 110. To determine a motion vector for the target block 130 that needs to be decoded in the current frame 110, motion search may be performed for one or more of the blocks 140 above and to the left of the target block 130, relative to the blocks 150 of reference frame 120, where blocks 150 correspond to blocks 140. Such an approach may be useful in decoding of predictive frames, also called P-frames, which hold only the changes relative to a previous frame.

In an embodiment, the raster scan coding order may be used to identify the spatial neighbor blocks that are above, to the left, above and to the left, and above and to the right of the target block.

Generally, this approach may be applied to available pixels of spatially neighboring blocks in the current frame, as long as the neighboring blocks were decoded prior to the target block in sequential scan coding order. Moreover, this approach may apply motion search with respect to reference frames in the reference frame list for a current frame.

The processing for this embodiment is illustrated as process 200 in FIG. 2. At 210, one or more blocks of pixels may be identified, where these blocks neighbor the target block of the current frame. Such neighboring blocks may or may not be immediately adjacent to the target block. At 220, motion search may be performed for the identified blocks. The motion search may be based on corresponding blocks of a reference frame, and at 230 yields motion vectors that connects the corresponding blocks of the reference frame to the identified blocks. Note that in an embodiment, 220 and 230 may precede 210, such that the motion vectors for the identified blocks may be known and the identified blocks decoded, prior to the identified blocks being used in this process. At 240, the motion vectors of the identified blocks are used to derive the motion vector for the target block, which may then be used for motion compensation for the target block. This derivation may be performed using any suitable process known to persons of ordinary skill in the art. Such a process may be, for example and without limitation, weighted averaging or median filtering. The process 200 concludes at 250.

FIG. 3 shows an embodiment 300 that may utilize one or more neighboring blocks 340 (shown here as blocks above and to the left of the target block 330) in a current frame 310. This may allow generation of a motion vector based on one or more corresponding blocks 350 and 355 in a previous reference frame 320 and a subsequent reference frame 360, respectively, where the terms “previous” and “subsequent” refer to temporal order. The motion vector can then be applied to target block 330. Here, the motion search may operate over an additional reference frame, in contrast to the embodiments of FIGS. 1 and 2. In an embodiment, a raster scan coding order may be used to determine spatial neighbor blocks above, to the left, above and to the left, and above and to the right of the target block. This approach may be used for bi-directional (B) frames, which use both the preceding and following frames for decoding.

The approach exemplified by FIG. 3 may be applied to available pixels of spatially neighboring blocks in a current frame, as long as the neighboring blocks were decoded prior to the target block in sequential scan coding order. Moreover, this approach may apply motion search with respect to reference frames in reference frame lists for a current frame.

The process of the embodiment of FIG. 3 is shown as process 400 of FIG. 4. At 410, one or more blocks of pixels may be identified in the current frame, where the identified blocks neighbor the target block of the current frame. At 420, motion search for the identified blocks may be performed, based on corresponding blocks in a temporally subsequent reference frame and on corresponding blocks in a previous reference frame. At 430, the motion search may result in motion vectors for the identified blocks. As in the case of FIGS. 2, 420 and 430 may precede 410, such that the motion vectors of the neighboring blocks may be determined prior to identification of those blocks. At 440, the motion vectors may be used to derive the motion vector for the target block, which may then be used for motion compensation for the target block. This derivation may be performed using any suitable process known to persons of ordinary skill in the art. Such a process may be, for example and without limitation, weighted averaging or median filtering. The process concludes at 450.

Already Decoded Blocks in Previously Decoded Frames

In this embodiment, pixels that can be used to determine an MV may come from a corresponding block in a previously reconstructed frame. FIG. 5 shows an example 500 of utilizing a block 540 from a previous frame 515, where the block 540 may be in a position corresponding to a target block 530 in a current frame 510. Here the MV can be derived from the relationship between the corresponding block 540 of the previously decoded frame 515 relative to one or more blocks 550 in a reference frame 520.

The processing for such an embodiment is shown in FIG. 6 as process 600. At 610, a block of pixels may be identified in a previous frame, where the identified block corresponds to a target block of a current frame. At 620, a motion vector may be determined for the identified block relative to a corresponding block in a reference frame. In an alternative embodiment, 620 may precede 610, such that the motion vector for the block of the previous frame may be derived prior to identifying the block for use with respect to the target block of the current frame. At 630, the motion vector may be used for the target block. The process may conclude at 640.

Another embodiment may use neighboring blocks next to the corresponding block of the previous frame to do the motion search in a reference frame. Examples of such neighboring blocks could be the blocks above, below, to the left, or to the right of the corresponding block in the previously reconstructed frame.

In an alternative embodiment, the available pixels can come from the corresponding blocks of previous and succeeding reconstructed frames in temporal order. This approach is illustrated in FIG. 7 as embodiment 700. To encode a target block 730 in a current frame 710, already decoded pixels may be used, where these pixels may be found in a corresponding block 740 of a previous frame 715, and in a corresponding block 765 of a succeeding frame 755. A first motion vector may be derived for corresponding block 740, by doing a motion search through one or more blocks 750 of reference frame 720. Block(s) 750 may neighbor a block in reference frame 720 that corresponds to block 740 of previous frame 715. A second motion vector may be derived for corresponding block 765 of succeeding frame 755, by doing a motion search through one or more blocks 770 of reference frame 760. Block(s) 770 may neighbor a block in reference frame 760 that corresponds to block 765 of succeeding frame 755. Based on the first and second motion vectors, forward and/or backward motion vectors for target block 730 may be determined. These latter motion vectors may then be used for motion compensation for the target block

This process is described as process 800 of FIG. 8. At 810, a block may be identified in a previous frame, where this identified block may correspond to the target block of the current frame. At 820, a first motion vector may be determined for this identified block of the previous frame, where the first motion vector may be defined relative to a corresponding block of a first reference frame. In 830, a block may be identified in a succeeding frame, where this block may correspond to the target block of the current frame. A second motion vector may be determined at 840 for this identified block of the succeeding frame, where the second motion vector may be defined relative to the corresponding block of a second reference frame. At 850, one or two motion vectors may be determined for the target block using the respective first and second motion vectors above. Process 800 may conclude at 860.

In another embodiment, neighboring blocks next to the corresponding block in the previous and succeeding reconstructed frames may be used to do the motion search based on their respective reference frames. An example of the neighboring blocks may be the blocks above, below, to the left, or to the right of the collocated blocks in the reconstructed frames, for example. Moreover, this approach can use motion search using reference frames in the reference frame lists, in both forward and backward temporal order.

Generally, the approach of FIGS. 3 and 7 may be used in the codec processing of bi-directional (B) frames.

Already Decoded Blocks in a Downsampled Frame in a Lower Pyramid of Layered Coding

In an embodiment, pixels that can be used to determine an MV for a target block may come from corresponding blocks in a lower layer whose video is downsampled from an original input in a scalable video coding scenario. FIG. 9 shows an example 900 utilizing a lower layer block 940 corresponding to the target block 930 of the current picture 910. The block 940 may occur in a picture 915 that corresponds to current picture 910. The corresponding block 940 can be used to perform the motion search, given one or more blocks 950 and 970 in respective reference pictures 920 and 960 in the lower layer. The reference pictures in the lower layer can be the forward or backward (previous or succeeding) pictures in temporal order. Since the motion vector may be derived in the downsampled layer, the motion vector may be upscaled before it is applied to the target block 930 in the target layer.

This approach may also be applied to already-decoded blocks that are spatial neighbors to the block 940 in the lower layer corresponding to the target frame 930 in the current picture 910.

The processing of FIG. 9 is shown as a flowchart 1000 in FIG. 10. At 1010, given a target block in a current frame, a corresponding block may be identified in a corresponding frame in a lower layer. At 1020, a motion vector may be determined for the corresponding block in the lower layer, relative to one or more reference frames in the lower layer. At 1030, the determined motion vector may be used for motion estimation for the target block in the current frame. The process may conclude at 1040.

In an alternative embodiment, 1020 may precede 1010, so that the motion vector is determined at the lower layer, prior to identifying the block in the lower layer for ME purposes for the target layer.

Mode Selection

A rate distortion optimization (RDO) model may be used to determine which coding mode is selected, given the options of motion estimation at video encoder side and motion estimation at video decoder side. The RDO model for motion estimation at the video encoder may generate a cost metric, and may include the costs of both coding distortion and MV bits, and the cost function for the motion estimation at the decoder may include only the coding distortion. In an embodiment, the video encoder may compare the costs for these two motion estimation options and determine which one to pick. In an embodiment, the video encoder may identify the chosen coding mode with a flag bit during communications between the encoder and the decoder. The video decoder may then act according to the state of the flag bit. If the flag bit indicates that motion estimation at the decoder side is utilized, the video decoder may derive the motion vector autonomously.

Such a mode selection process is illustrated in FIG. 11, as process 1100. At 1120, traditional encoder side motion estimation (ME) may first be performed to get an MV for this coding mode. At 1130, the corresponding RDO cost metric may be calculated. Let this cost be J0. At 1140, ME is performed at the decoder as described in any of the above embodiments, to get an MV for this coding mode. At 1150, the corresponding RDO cost metric may be calculated to be J1. At 1160, if J1<J0, then at 1170, the decoder side ME based result may be chosen. Otherwise, the result from the traditional ME based coding mode may be chosen at 1180. The process may conclude at 1190. In an alternative embodiment, more than two modes may be similarly evaluated, where the mode having the lowest RDO cost metric may be chosen. A flag can be used to signal the chosen mode in the communications between the encoder and decoder.

System

Logic to perform the processing described above may be incorporated in a self MV derivation module that is used in a larger codec architecture. FIG. 12 illustrates an exemplary H.264 video encoder architecture 1200 that may include a self MV derivation module 1240, where H.264 is a video codec standard. Current video information may be provided from a current video block 1210 in a form of a plurality of frames. The current video may be passed to a differencing unit 1211. The differencing unit 1211 may be part of the Differential Pulse Code Modulation (DPCM) (also called the core video encoding) loop, which may include a motion compensation stage 1222 and a motion estimation stage 1218. The loop may also include an intra prediction stage 1220, and intra interpolation stage 1224. In some cases, an in-loop deblocking filter 1226 may also be used in the loop.

The current video may be provided to the differencing unit 1211 and to the motion estimation stage 1218. The motion compensation stage 1222 or the intra interpolation stage 1224 may produce an output through a switch 1223 that may then be subtracted from the current video 1210 to produce a residual. The residual may then be transformed and quantized at transform/quantization stage 1212 and subjected to entropy encoding in block 1214. A channel output results at block 1216.

The output of motion compensation stage 1222 or inter-interpolation stage 1224 may be provided to a summer 1233 that may also receive an input from inverse quantization unit 1230 and inverse transform unit 1232. These latter two units may undo the transformation and quantization of the transform/quantization stage 1212. The inverse transform unit 1232 may provide dequantized and detransformed information back to the loop.

A self MV derivation module 1240 may implement the processing described herein for derivation of a motion vector from previously decoded pixels. Self MV derivation module 1240 may receive the output of in-loop deblocking filter 1226, and may provide an output to motion compensation stage 1222.

FIG. 13 illustrates an H.264 video decoder 1300 with a self MV derivation module 1310. Here, a decoder 1300 for the encoder 1200 of FIG. 12 may include a channel input 1338 coupled to an entropy decoding unit 1340. The output from the decoding unit 1340 may be provided to an inverse quantization unit 1342 and an inverse transform unit 1344, and to self MV derivation module 1310. The self MV derivation module 1310 may be coupled to a motion compensation unit 1348. The output of the entropy decoding unit 1340 may also be provided to intra interpolation unit 1354, which may feed a selector switch 1323. The information from the inverse transform unit 1344, and either the motion compensation unit 1348 or the intra interpolation unit 1354 as selected by the switch 1323, may then be summed and provided to an in-loop de-blocking unit 1346 and fed back to intra interpolation unit 1354. The output of the in-loop deblocking unit 1346 may then be fed to the self MV derivation module 1310.

The self MV derivation module may be located at the video encoder, and synchronize with the video decoder side. The self MV derivation module could alternatively be applied on a generic video codec architecture, and is not limited to the H.264 coding architecture.

The encoder and decoder described above, and the processing performed by them as described above, may be implemented in hardware, firmware, or software, or some combination thereof. In addition, any one or more features disclosed herein may be implemented in hardware, software, firmware, and combinations thereof, including discrete and integrated circuit logic, application specific integrated circuit (ASIC) logic, and microcontrollers, and may be implemented as part of a domain-specific integrated circuit package, or a combination of integrated circuit packages. The term software, as used herein, refers to a computer program product including a computer readable medium having computer program logic stored therein to cause a computer system to perform one or more features and/or combinations of features disclosed herein.

A software or firmware embodiment of the processing described above is illustrated in FIG. 14. System 1400 may include a processor 1460 and a body of memory 1410 that may include one or more computer readable media that store computer program logic 1420. Memory 1410 may be implemented as a hard disk and drive, a removable media such as a compact disk and drive, or a read-only memory (ROM) device, for example. Processor 1460 and memory 1410 may be in communication using any of several technologies known to one of ordinary skill in the art, such as a bus. Logic contained in memory 1410 may be read and executed by processor 1460. One or more I/O ports and/or I/O devices, shown as I/O 1470, may also be connected to processor 1460 and memory 1410.

Computer program logic 1420 may include decoded block identification logic 1430. This module of computer program logic, when executed on processor 1460, identifies a block of pixels that may ultimately be used to determine a motion vector for a target block. Computer program logic 1420 may also include motion vector determination logic 1440. This module of computer program logic, when executed on processor 1460, determines a motion vector on the basis of the identified block of pixels identified by decoded block identification logic 1430, relative to one or more reference frames. Computer program logic 1420 may also include motion vector application logic 1450. This module of computer program logic, when executed on processor 1460, uses the motion vector determined by logic module 1440 to perform motion estimation for the target block.

Alternatively, any of the logic modules shown in computer program logic 1420 may be implemented in hardware.

Methods and systems are disclosed herein with the aid of functional building blocks, such as those listed above, describing the functions, features, and relationships thereof. At least some of the boundaries of these functional building blocks have been arbitrarily defined herein for the convenience of the description. Alternate boundaries may be defined so long as the specified functions and relationships thereof are appropriately performed. In addition, the encoder and decoder described above may by incorporated in respective systems that encode a video signal and decode the resulting encoded signal respectively using the processes noted above.

While various embodiments are disclosed herein, it should be understood that they have been presented by way of example only, and not limitation. It will be apparent to persons skilled in the relevant art that various changes in form and detail may be made therein without departing from the spirit and scope of the methods and systems disclosed herein. Thus, the breadth and scope of the claims should not be limited by any of the exemplary embodiments disclosed herein. 

What is claimed is:
 1. A video encoding method comprising: determining a first cost metric corresponding to motion estimation at a video decoder, the first cost metric consisting of only coding distortion for motion estimation at the video decoder; determining a second cost metric corresponding to motion estimation at a video encoder, the second cost metric comprising costs of coding distortion and motion vector bits for motion estimation at the video encoder; selecting a coding mode from motion estimation at the video decoder and motion estimation at the video encoder based on a comparison of the first and second cost metrics; and identifying the selected coding mode for use in video decode.
 2. The video encoding method of claim 1, wherein determining the first cost metric comprises performing decoder side motion estimation and selecting a first motion vector for a first coding mode corresponding to the first cost metric.
 3. The video encoding method of claim 2, wherein determining the second cost metric comprises performing encoder side motion estimation and selecting a second motion vector for a second coding mode corresponding to the second cost metric.
 4. The video encoding method of claim 2, wherein the decoder side motion estimation comprises: selecting a first block of decoded pixels of a first reference frame, the first block corresponding to a first target block in a current frame; and identifying the first motion vector for the first target block based on motion estimation of a second reference frame using the first block.
 5. The video encoding method of claim 4, wherein the first block is in a position in the first reference frame corresponding to a position of the first target block in the current frame, the first reference frame is temporally previous to the current frame and the second reference frame is temporally previous to the first reference frame.
 6. The video encoding method of claim 4, wherein the first cost metric is based on motion compensation of the first target block using the first motion vector.
 7. The video encoding method of claim 4, further comprising: selecting a second block of decoded pixels of a third reference frame, the second block corresponding to the first target block, wherein the first motion vector is identified further based on motion estimation of a fourth reference frame using the second block.
 8. A video encoder comprising: a memory; and one or more processors in communication with the memory, the one or more processors to: determine a first cost metric corresponding to motion estimation at a video decoder, the first cost metric consisting of only coding distortion for motion estimation at the video decoder; determine a second cost metric corresponding to motion estimation at a video encoder, the second cost metric comprising costs of coding distortion and motion vector bits for motion estimation at the video encoder; select a coding mode from motion estimation at the video decoder and motion estimation at the video encoder based on a comparison of the first and second cost metrics; and identify the selected coding mode for use in video decode.
 9. The video encoder of claim 8, wherein the one or more processors to determine the first cost metric comprises the one or more processors to perform decoder side motion estimation and select a first motion vector for a first coding mode corresponding to the first cost metric.
 10. The video encoder of claim 9, wherein the one or more processors to determine the second cost metric comprises the one or more processors to perform encoder side motion estimation and select a second motion vector for a second coding mode corresponding to the second cost metric.
 11. The video encoder of claim 9, wherein the decoder side motion estimation comprises the one or more processors to: select a first block of decoded pixels of a first reference frame, the first block corresponding to a first target block in a current frame; and identify the first motion vector for the first target block based on motion estimation of a second reference frame using the first block.
 12. The video encoder of claim 11, wherein the first block is in a position in the first reference frame corresponding to a position of the first target block in the current frame, the first reference frame is temporally previous to the current frame and the second reference frame is temporally previous to the first reference frame.
 13. The video encoder of claim 11, wherein the first cost metric is based on motion compensation of the first target block using the first motion vector.
 14. The video encoder of claim 11, the one or more processors to: select a second block of decoded pixels of a third reference frame, the second block corresponding to the first target block, wherein the first motion vector is identified further based on motion estimation of a fourth reference frame using the second block.
 15. At least one non-transitory computer-readable medium comprising instructions stored thereon, which if executed by one or more processors, cause the one or more processors perform video encoding by: determining a first cost metric corresponding to motion estimation at a video decoder, the first cost metric consisting of only coding distortion for motion estimation at the video decoder; determining a second cost metric corresponding to motion estimation at a video encoder, the second cost metric comprising costs of coding distortion and motion vector bits for motion estimation at the video encoder; selecting a coding mode from motion estimation at the video decoder and motion estimation at the video encoder based on a comparison of the first and second cost metrics; and identifying the selected coding mode for use in video decode.
 16. The non-transitory computer-readable medium of claim 15, wherein determining the first cost metric comprises performing decoder side motion estimation and selecting a first motion vector for a first coding mode corresponding to the first cost metric.
 17. The non-transitory computer-readable medium of claim 16, wherein determining the second cost metric comprises performing encoder side motion estimation and selecting a second motion vector for a second coding mode corresponding to the second cost metric.
 18. The non-transitory computer-readable medium of claim 16, wherein the decoder side motion estimation comprises: selecting a first block of decoded pixels of a first reference frame, the first block corresponding to a first target block in a current frame; and identifying the first motion vector for the first target block based on motion estimation of a second reference frame using the first block.
 19. The non-transitory computer-readable medium of claim 18, wherein the first block is in a position in the first reference frame corresponding to a position of the first target block in the current frame, the first reference frame is temporally previous to the current frame and the second reference frame is temporally previous to the first reference frame.
 20. The non-transitory computer-readable medium of claim 18, wherein the first cost metric is based on motion compensation of the first target block using the first motion vector. 